Local temporal logic is expressively complete for cograph dependence alphabets
نویسندگان
چکیده
منابع مشابه
Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets
Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in the word case. If we focus on a purely local interpretation of formulae at vertices (or events) of a trace, then the satisfiability problem of linear temporal logics over traces turns out to be PSPACE–complete. But now the diffic...
متن کاملWhen is Metric Temporal Logic Expressively Complete?
A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates. A key question is whether there exists an analogue of Kamp’s theorem for Metric Temporal Logic (MTL) – a generalization of LTL in which the Until and Since modalities are annotated with intervals that express metric c...
متن کاملAn Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces
A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the co...
متن کاملAn Expressively Complete Linear Time Temporal
A basic result concerning LT L, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the rst order theory of sequences. We present here a smooth extension of this result to the class of partial orders known as Mazurkiewicz traces. These partial orders arise in a variety of contexts in concurrency theory and they provide the con...
متن کاملLTL Is Expressively Complete for Mazurkiewicz Traces
A long standing open problem in the theory of (Mazurkiewicz) traces has been the question whether LTL (Linear Temporal Logic) is expressively complete with respect to the first order theory. We solve this problem positively for finite and infinite traces and for the simplest temporal logic, which is based only on next and until modalities. Similar results were established previously, but they w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2004
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.08.001